An analysis of degeneracy

Degeneracy in linear programming models has been analyzed for its impacts on algorithmic properties. A complementary analysis here is on what the solutions mean. The framework presented is couched in marginal sensitivity analysis, introducing concepts of “compatible bases” and “transition graphs”.     

模态加法度法在自由界面的复模态综合技术中的应用

本文提出了一种考虑界面力影响的自由界面复模态综合法。根据模态加速度法导出了部件的物理坐标表达式,再根据系统的虚功原理导出了系统广义坐标的运动方程,从而大大地缩小了系统的独立坐标数。并且在执行过程中不需求出部件的全部复模态。该方法很适应于系统各部件分散情况下的单独实验和计算,从而使得计算和模态试验更有效地结合起来。     

Comparative evaluation of prior versus progressive articulation of preference in bicriterion optimization

Procedures for solving multiple criteria problems are receiving increasing attention. Two major solution approaches are those involving prior articulation and progressive articulation of preference information. A progressive articulation (interactive) optimization approach, called the Paired Comparison Method (PCM) is compared to the prior articulation approach of a priori utility function measurement in a quality control decision environment from the perspective of the decision maker. The three major issues investigated included: (1) the ease of use of each method, (2) the preferences of solutions obtained, and (3) the insight provided by the methodology into the nature and structure of the problem. The problem setting involved management students who were rquired to determine an acceptance sampling plan using both methods. The PCM provided the most preferred solutions and was considered easier to use and understand. The prior articulation of preference method was found to give more insight into the problem structure. The results suggest that a hybrid approach, combining both prior preference assessment and an interactive procedure exploiting the advantages of each, should be employed to solve multiple criteria problems.     

Geometric programming with multiplicative slack variables

A posynomial geometric programming problem formulated so that the number of objective function terms is equal to the number of primal variables will have a zero degree of difficulty when augmented by multiplying each constraint term by a slack variable and including a surrogate constraint composed of the product of the slack variables, each raised to an undetermined negative exponent or surrogate multiplier. It is assumed that the original problem is canonical. The exponents in the constraint on the product of the slack variables must be estimated so that the associated solution to the augmented problem, obtained immediately, also solves the original problem. An iterative search procedure for finding the required exponents, thus solving the original problem, is described. The search procedure has proven quite efficient, often requiring only two or three iterations per degree of difficulty of the original problem. At each iteration the well-known procedure for solving a geometric programming problem with a zero degree of difficulty is used and so computations are simple. The solution generated at each iteration is optimal for a problem which differs from the original problem only in the values of some of the constraint coefficients, so intermediate solutions provide useful information.     

On a large sample test for the traffic intensity in GI|G|s queue

A large sample test based on normal approximation for the traffic intensity parameter ρ in the cases of single and multiple-server queues has been proposed. The test procedure is developed without imposing steady-state assumptions and is applicable to queueing systems with general interarrival and service-time distributions.     

Approximation for the departure process of a queue in a network

A simple renewal process is identified to approximate the complex departure process of a queue often found in queueing network models. The arrival process to the queue is the superposition or merging of several independent component-renewal processes that are approximations of departure processes from other queues and external arrival processes; there is a single server with exponential service times, and the waiting space is infinite. The departure process of this queue is of interest because it is the arrival process to other queues in the network. The approximation proposed is a hybrid; the mean and variance of the approximating departure intervals is a weighted average of those determined by basic methods in Whitt [41] with the weighting function empirically determined using simulation. Tandem queueing systems with superposition arrival processes and exponential service times are used to evaluate the approximation. The departure process of the first queue in the tandem is approximated by a renewal process, the tandem system is replaced by two independent queues, and the second queue is solved analytically. When compared to simulation estimates, the average absolute error in hybrid approximations of the expected number in the second queue is 6%, a significant improvement over 22–41% in the basic methods.     

Decentralized stockage policies in a multiechelon environment

Characteristics of supply performance at the top echelon of an optimally managed multiechelon supply system are investigated; insights are developed which are useful in devising coordinated single-echelon policies which can approximate the benefits derived from multiechelon management.